Kinetic and dynamic data structures for convex hulls and upper envelopes
نویسندگان
چکیده
منابع مشابه
Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes
Let S be a set of n moving points in the plane. We present a kinetic and dynamic (randomized) data structure for maintaining the convex hull of S. The structure uses O(n) space, and processes an expected number of O(nβs+2(n) logn) critical events, each in O(log n) expected time, including O(n) insertions, deletions, and changes in the flight plans of the points. Here s is the maximum number of ...
متن کاملdiagnostic and developmental potentials of dynamic assessment for writing skill
این پایان نامه بدنبال بررسی کاربرد ارزیابی مستمر در یک محیط یادگیری زبان دوم از طریق طرح چهار سوال تحقیق زیر بود: (1) درک توانایی های فراگیران زمانیکه که از طریق برآورد عملکرد مستقل آنها امکان پذیر نباشد اما در طول جلسات ارزیابی مستمر مشخص شوند; (2) امکان تقویت توانایی های فراگیران از طریق ارزیابی مستمر; (3) سودمندی ارزیابی مستمر در هدایت آموزش فردی به سمتی که به منطقه ی تقریبی رشد افراد حساس ا...
15 صفحه اولRobust Kinetic Convex Hulls in 3D
Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have been proposed, some difficulties remain in devising and implementing them, especially robustly. One set of difficulties stems from the required update mechanisms used for processing certificate failures—devising efficient upda...
متن کاملKinetic Convex Hulls, Delaunay Triangulations and Connectivity Structures in the Black-Box Model
Over the past decade, the kinetic-data-structures framework has become the standard in computational geometry for dealing with moving objects. A fundamental assumption underlying the framework is that the motions of the objects are known in advance. This assumption severely limits the applicability of KDSs. We study KDSs in the black-box model, which is a hybrid of the KDS model and the traditi...
متن کاملIncremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas
The existing O(n logn) algorithms for nding the convex hulls of circles and the lower envelope of parabolas follow the divide-and-conquer paradigm. The di culty with developing incremental algorithms for these problems is that the introduction of a new circle or parabola can cause (n) structural changes, leading to (n) total structural changes during the running of the algorithm. In this note w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2007
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2006.01.002